منابع مشابه
Monoidal cut strengthening and generalized mixed-integer rounding for disjunctions and complementarity constraints
In the early 1980s, Balas and Jeroslow presented monoidal disjunctive cuts exploiting the integrality of variables. This article investigates the relation of monoidal cut strengthening to other classes of cutting planes for general two-term disjunctions. We introduce a generalization of mixed-integer rounding cuts and show equivalence to monoidal disjunctive cuts. Moreover, we demonstrate the e...
متن کاملMonoidal Cut Strengthening and Generalized Mixed-Integer Rounding for Disjunctive Programs∗
This article investigates cutting planes for mixed-integer disjunctive programs. In the early 1980s, Balas and Jeroslow presented monoidal disjunctive cuts exploiting the integrality of variables. For disjunctions arising from binary variables, it is known that these cutting planes are essentially the same as Gomory mixed-integer and mixed-integer rounding cuts. In this article, we investigate ...
متن کاملWeakening and strengthening in Romance revisited
This paper investigates the extent to which segmental substitutions traditionally attributed to articulatory weakening and strengthening through changes in constriction degree are, in fact, caused by aerodynamic, perceptual or other articulatory mechanisms. For that purpose the articulatory, acoustic and distributional characteristics of consonants participating in the implementation of several...
متن کاملBetter Ways to Cut a Cake - Revisited
Procedures to divide a cake among n people with n-1 cuts (the minimum number) are analyzed and compared. For 2 persons, cut-and-choose, while envy-free and efficient, limits the cutter to exactly 50% if he or she is ignorant of the chooser’s preferences, whereas the chooser can generally obtain more. By comparison, a new 2person surplus procedure (SP’), which induces the players to be truthful ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Optimization
سال: 2012
ISSN: 1572-5286
DOI: 10.1016/j.disopt.2011.11.002